Embedding Starlike Trees into Hypercube-Like Interconnection Networks
نویسندگان
چکیده
A starlike tree (or a quasistar) is a subdivision of a star tree. A family of hypercube-like interconnection networks called restricted HLgraphs includes many interconnection networks proposed in the literature such as twisted cubes, crossed cubes, multiply twisted cubes, Möbius cubes, Mcubes, and generalized twisted cubes. We show in this paper that every starlike tree of degree at most m with 2 vertices is a spanning tree of m-dimensional restricted HL-graphs. It is also proved that in an mdimensional restricted HL-graph, there exist k(≤ m− 1) vertex-disjoint si-paths with li vertices each that cover all the vertices in the graph for any k sources s1, s2, . . . , sk associated with positive integers l1, l2, . . . , lk whose sum is equal to the number of vertices.
منابع مشابه
Mapping Problem and Embedding of Various Networks into Hypercubes
The purpose of embedding (or mapping) is to minimize the communication overhead of parallel algorithms. It appears unlikely that an efficient exact technique of embedding a general guest graph in a general host graph with a minimum-dilation will ever be found. The Research in this area is concentrating on discovering efficient heuristic that find solution in most cases. This article is a survey...
متن کاملEmbeddings into Crossed Cubes
The hypercube parallel architecture is one of the most popular interconnection networks due to many of its attractive properties and its suitability for general purpose parallel processing. An attractive version of the hypercube is the crossed cube. It preserves the important properties of the hypercube and most importantly reduces the diameter by a factor of two. In this paper, we show the abi...
متن کاملTwo new classes of trees embeddable into hypercubes
The problem of embedding graphs into other graphs is much studied in the graph theory. In fact, much effort has been devoted to determining the conditions under which a graph G is a subgraph of a graph H, having a particular structure. An important class to study is the set of graphs which are embeddable into a hypercube. This importance results from the remarkable properties of the hypercube a...
متن کاملHierarchical Networks Into The Hypercube
The embedding of one interconnection network into another is a very important issue in the design and analysis of parallel algorithms. Through such embeddings the algorithms originally developed for one architecture can be directly mapped to another architecture. This paper describes novel methods for the embedding of hierarchical interconnection networks in the hypercube to minimize the dilati...
متن کاملEmbedding an Arbitrary Binary Tree into the Star Graph
| Binary tree structures have been very useful in solving divide-and-conquer type of problems. Embedding binary trees into another network|the host network|helps in designing solutions for the host network using the known solutions on binary trees. Embedding arbitrary binary trees into networks, in particular into the hypercube, has been addressed in the literature. The latter was achieved with...
متن کامل